#include<bits/stdc++.h>
using namespace std;
#define int long long

int s[200005], ranks[200005];

signed main() {
	int n;
	cin >> n;

	vector<pair<int, int>> a(n);
	for (int i = 0; i < n; i++) {
		cin >> s[i];
		a[i] = {s[i], i + 1};
	}

	sort(a.begin(), a.end(), [](pair<int, int> x, pair<int, int> y) {
		if (x.first != y.first)
			return x.first > y.first;
		else
			return x.second < y.second;
	});

	for (int i = 0; i < n; i++) {
		cout << a[i].second << endl;
	}
	return 0;
}
